Matui's AH conjecture for graph groupoids
نویسندگان
چکیده
We prove that Matui's AH conjecture holds for graph groupoids of infinite graphs. This is a which relates the topological full group an ample groupoid with homology groupoid. Our main result complements in finite case, makes true all covered by assumptions said conjecture. Furthermore, we observe arbitrary graphs, coincides $K$-theory its $C^*$-algebra.
منابع مشابه
The Generalized Effros-hahn Conjecture for Groupoids
Abstract. The generalized Effros-Hahn conjecture for groupoid C-algebras says that, if G is amenable, then every primitive ideal of the groupoid Calgebra C(G) is induced from a stability group. We prove that the conjecture is valid for all second countable amenable locally compact Hausdorff groupoids. Our results are a sharpening of previous work of Jean Renault and depend significantly on his ...
متن کاملThe coarse Baum–Connes conjecture and groupoids. II
Given a (not necessarily discrete) proper metric space M with bounded geometry, we define a groupoid G(M). We show that the coarse Baum–Connes conjecture with coefficients, which states that the assembly map with coefficients for G(M) is an isomorphism, is hereditary by taking closed subspaces.
متن کاملCombinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature” etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. A new, holonomy-type invariant for cubical complexes is introduced, leading to a combinatorial “Theorema Egregium”...
متن کاملOn the Graph Complement Conjecture for Minimum
The minimum rank of a graph has been an interesting and well studied parameter 6 investigated by many researchers over the past decade or so. One of the many unresolved questions on 7 this topic is the so-called graph complement conjecture, which grew out of a workshop in 2006. This 8 conjecture asks for an upper bound on the sum of the minimum rank of a graph and the minimum rank 9 of its comp...
متن کاملOn the Hadwiger's conjecture for graph products
The Hadwiger number (G) of a graph G is the largest integer h such that the complete graph on h nodes Kh is a minor of G. Equivalently, (G) is the largest integer such that any graph on at most (G) nodes is a minor ofG. The Hadwiger’s conjecture states that for any graph G, (G) (G), where (G) is the chromatic number of G. It is well-known that for any connected undirected graph G, there exists ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Documenta Mathematica
سال: 2021
ISSN: ['1431-0635', '1431-0643']
DOI: https://doi.org/10.4171/dm/853